Generalized Non-Reducible Descriptors
نویسندگان
چکیده
This paper provide a generalization of non-reducible descriptors. Non-reducible descriptors are used in supervised pattern recognition problems when the pattern descriptions consist of Boolean variables. This generalization extends the concept of distance between patterns of different classes. A mathematical model to construct generalized non-reducible descriptors, a computational procedure, and numerical examples are discussed.
منابع مشابه
Constructing Quantitative Non-Reducible Descriptors
The classical supervised pattern recognition problem is considered. A model of learning Boolean formulas is implemented. A new computational procedure for constructing quantitative non-reducible descriptors is suggested. The proposed procedure has a diminished number of computational operations with respect to the procedure for constructing non-reducible descriptors and allows incremental learn...
متن کاملECG Recognition by Non-Reducible Descriptors
The classical pattern recognition problems are considered. A model of learning Boolean formulas is implemented. Computational procedures for constructing non-reducible descriptors and clusters are brieey discussed. Possible applications of non-reducible de-scriptors to ECG analysis and ECG recognition are suggested.
متن کاملStructural Pattern Recognitionby Non - Reducible
The classiication technique by Non-Reducible Descriptors provides decision rules in term of Boolean formulae on object's key features. In this paper we present an extension of the Non-Reducible Descriptors that contains quantitative information. By Quantitative Non-Reducible Descriptor of an object, the distance to the descriptions of objects from another classes is explicitly expressed. This f...
متن کاملFrom binary features to Non-Reducible Descriptors in supervised pattern recognition problems
The present paper explores the supervised pattern recognition problem when binary features are used in pattern descriptions. The concept of Non-Reducible Descriptors (NRDs) for binary features is introduced. NRDs are descriptors of patterns that do not contain any redundant information. They correspond to syndromes in medical diagnosis and are represented as conjunctions. The proposed approach ...
متن کاملConcurrent vector fields on Finsler spaces
In this paper, we prove that a non-Riemannian isotropic Berwald metric or a non-Riemannian (α,β) -metric admits no concurrent vector fields. We also prove that an L-reducible Finsler metric admitting a concurrent vector field reduces to a Landsberg metric.In this paper, we prove that a non-Riemannian isotropic Berwald metric or a non-Riemannian (α,β) -metric admits no concurrent vector fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000